public class HashBuck2<K,V> {

    static class Node<K,V> {
        public K key;
        public V value;
        public Node<K,V> next;

        public Node(K key,V value) {
            this.key = key;
            this.value = value;
        }
    }
    public Node<K,V>[] array = (Node<K, V>[]) new Node[10];
    public int usedSize;

    public static final double DEFAULT_LOAD_FACTOR = 0.75f;

    public void put(K key,V value) {
        int hashcode = key.hashCode();//计算出位置
        int index = hashcode % array.length;

        Node<K,V> cur = array[index];
        while (cur != null) {
            if (cur.key == key) {
                cur.value = value;
                return;
            }
            cur = cur.next;
        }

        Node<K,V> newNode = new Node<>(key, value);
        newNode.next = array[index];
        array[index] = newNode;

        usedSize++;
    }

    public V getVal(K key) {
        int hashcode = key.hashCode();//计算出位置
        int index = hashcode % array.length;

        Node<K,V> cur = array[index];

        while(cur != null) {
            if (cur.key.equals(key)) {
                return cur.value;
            }
            cur = cur.next;
        }

        return null;
    }
}
